Optimal VCG Mechanisms to Assign Multiple Tasks∗

نویسنده

  • Jung S. You
چکیده

We develop optimal VCG mechanisms in order to assign identical economic “bads” (for example, costly tasks) to agents. The optimal non-deficit VCG mechanism achieves asymptotic budget balance, yet the non-deficit requirement is incompatible with reasonable welfare bounds. If we omit the non-deficit requirement, individual rationality greatly changes the relationship between burning a budget surplus and financing a budget deficit. Allowing a slight deficit, the optimal individually rational VCG mechanism becomes asymptotically budget balanced more easily. Such a phenomenon cannot be found in the case of assigning economic “goods.”

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost budget-balanced VCG mechanisms to assign multiple objects

Subsidy-free VCG mechanisms assign p identical objects to n agents. The efficiency loss is the largest ratio of budget surplus to efficient surplus, over all profiles of non-negative valuations. The smallest efficiency loss L̂(n,p) satisfies L̂(n,p) L̂(n, n2 ) 4 3√n . If p n is bounded away from 1 2 , L̂(n,p) converges to zero exponentially in n. Participation is voluntary in the optimal mechanism ...

متن کامل

Worst-case optimal redistribution of VCG payments in heterogeneous-item auctions with unit demand

Many important problems in multiagent systems involve the allocation of multiple resources among the agents. For resource allocation problems, the well-known VCG mechanism satisfies a list of desired properties, including efficiency, strategy-proofness, individual rationality, and the non-deficit property. However, VCG is generally not budget-balanced. Under VCG, agents pay the VCG payments, wh...

متن کامل

Worst-case optimal redistribution of VCG payments in multi-unit auctions

For allocation problems with one or more items, the well-known VickreyClarke-Groves (VCG) mechanism (aka. Clarke mechanism, Generalized Vickrey Auction) is efficient, strategy-proof, individually rational, and does not incur a deficit. However, it is not (strongly) budget balanced: generally, the agents’ payments will sum to more than 0. We study mechanisms that redistribute some of the VCG pay...

متن کامل

Truthful Incentive Mechanisms for Social Cost Minimization in Mobile Crowdsourcing Systems

With the emergence of new technologies, mobile devices are capable of undertaking computational and sensing tasks. A large number of users with these mobile devices promote the formation of the Mobile Crowdsourcing Systems (MCSs). Within a MCS, each mobile device can contribute to the crowdsourcing platform and get rewards from it. In order to achieve better performance, it is important to desi...

متن کامل

VCG Redistribution with Gross Substitutes

For the problem of allocating resources among multiple strategic agents, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, strategy-proof, and it never incurs a deficit. However, in general, under the VCG mechanism, payments flow out of the system of agents, which reduces the agents’ utilities. VCG redistribution mechanisms aim to return as much of the VCG payments as possible ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011